package array.leetcode.easy;

import java.util.HashMap;
import java.util.Map;

/**
 * @author bruin_du
 * @description 两数之和
 * @date 2022/6/5 20:50
 **/
public class Num1_TwoSum {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer,Integer> map = new HashMap<>();
        for (int i = 0; i < nums.length; i++) {
            if(map.containsKey(target - nums[i])){
                return new int[]{map.get(target - nums[i]),i};
            }
            map.put(nums[i],i);
        }
        return new int[0];
    }
}
